Determinacy Proofs for Long games
نویسنده
چکیده
1. Preliminaries: (a) The games. (b) Extenders, iteration trees. (c) Auxiliary game representations. (d) Example: Σ 1 2 determinacy. 2. Games of length ω · ω with Σ 1 2 payoff. 3. Continuously coded games with Σ 1 2 payoff.
منابع مشابه
An Introduction to Proofs of Determinacy of Long Games
We present the basic methods used in proofs of determinacy of long games, and apply these methods to games of continuously coded length. From the dawn of time women and men have aspired upward. The development of determinacy proofs is no exception to this general rule. There has been a steady search for higher forms of determinacy, beginning with the results of Gale–Stewart [2] on closed length...
متن کاملExtending Finite Memory Determinacy to Multiplayer Games
We provide several techniques to extend finite memory determinacy from some restricted class of games played on a finite graph to a larger class. As a particular example, we study energy parity games. First we show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built fro...
متن کاملDeterminacy for games ending at the first admissible relative to the play
Let o(κ) denote the Mitchell order of κ. We show how to reduce long games which run to the first ordinal admissible in the play, to iteration games on models with a cardinal κ so that (1) κ is a limit of Woodin cardinals; and (2) o(κ) = κ. We use the reduction to derive several optimal determinacy results on games which run to the first admissible in the play. Given a set C ⊂ R1 consider the fo...
متن کاملMemoryless determinacy of finite parity games: Another simple proof
Memoryless determinacy of (infinite) parity games is an important result with numerous applications. It was first independently established by Emerson and Jutla [1] and Mostowski [2] but their proofs involve elaborate developments. The elegant and simpler proof of Zielonka [3] still requires a nested induction on the finite number of priorities and on ordinals for sets of vertices. There are ot...
متن کاملGames of Length Ω1
We prove determinacy for open length ω1 games. Going further we introduce, and prove determinacy for, a stronger class of games of length ω1, with payoff conditions involving the entire run, the club filter on ω1, and a sequence of ω1 disjoint stationary subsets of ω1. The determinacy proofs use an iterable model with a class of indiscernible Woodin cardinals, and we show that the games precise...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004